Computational aspects of the refinement of 3D tetrahedral meshes

The refinement of tetrahedral meshes is a significant task in many numerical and discretizations methods. The computational aspects for implementing refinement of meshes with complex geometry need to be carefully considered in order to have real-time and optimal results. In this paper we study some computational aspects of a class of tetrahedral refinement algorithms. For local adaptive refinement we give numerical results of the computational propagation cost of a general class of longest edge based refinement and show the implications of the geometry in the global process. Moreover we study the conformity process based on the longest edge bisection and give an algorithm and data structure to efficiently handle tetrahedral refinement.